On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms
نویسندگان
چکیده
منابع مشابه
META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملConstrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
Motivated by the research in reconfigurable memory array structures, this paper studies the complexity and algorithms for the constrained minimum vertex cover problem on bipartite graphs (min-cvcb) defined as follows: given a bipartite graph G 1⁄4 ðV ;EÞ with vertex bipartition V 1⁄4 U,L and two integers ku and kl ; decide whether there is a minimum vertex cover in G with at most ku vertices in...
متن کاملLinear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs
A bipartite graph G = (U, V,E) is convex if the vertices in V can be linearly ordered such that for each vertex u ∈ U , the neighbors of u are consecutive in the ordering of V . An induced matching H of G is a matching such that no edge of E connects endpoints of two different edges of H. We show that in a convex bipartite graph with n vertices and m weighted edges, an induced matching of maxim...
متن کاملMETAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...
متن کاملOn Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs
We consider the minimum feedback vertex set problem for some bipartite graphs and degree-constrained graphs. We show that the problem is linear time solvable for bipartite permutation graphs and NP-hard for grid intersection graphs. We also show that the problem is solvable in O(n2 log6 n) time for n-vertex graphs with maximum degree at most three. key words: 3-regular graph, bipartite permutat...
متن کامل